Expressibility of Valued Constraints
نویسنده
چکیده
In this paper we present a project on the expressibility of valued constraints. We recall the result of Cohen et al. [2] which characterises the expressibility of valued constraints in terms of algebraic properties of the constraints. We show why the current algebraic characterisation is rather unsatisfactory and what are the ways we try to explore in order to find a better one.
منابع مشابه
On sufficient conditions for expressibility of constants in the 4-valued extension of the propositional provability logic $GL$
In the present paper we consider the simplest non-classical extension GL4 of the well-known propositional provability logic GL together with the notion of expressibility of formulas in a logic proposed by A. V. Kuznetsov. Conditions for expressibility of constants in GL4 are found out, which were first announced in a author’s paper in 1996.
متن کاملLinear vs Polynomial Constraints in Database Query Languages
We prove positive and negative results on the expressive power of the relational calculus augmented with linear constraints. We show non-expressibility of some properties expressed by polynomial constraints. We also show expressibility of some queries involving existence of lines, when the query output has a simple geometrical relation to the input. Finally, we compare the expressive power of l...
متن کاملThe complexity and expressive power of valued constraints
This thesis is a detailed examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a generalisation of the constraint satisfaction problem which allows a variety of combinatorial optimisation problems to be described. Although most results are stated in this framework, they can be interpreted equivalently in...
متن کاملFinding p-indecomposable Functions: FCA Approach
The parametric expressibility of functions is a generalization of the expressibility via composition. All parametrically closed classes of functions (p-clones) form a lattice. For finite domains the lattice is shown to be finite, however straight-forward iteration over all functions is infeasible, and so far the p-indecomposable functions are only known for domains with two and three elements. ...
متن کاملApproximating Holant problems by winding
We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations. The approach combines a sampler for near-assignments of “windable” functions – using the cycle-unwinding canonical paths technique of Jerrum and Sinclair – with a bound on the weight of nearassignments. The proof generalises to a larger ...
متن کامل